How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages
نویسندگان
چکیده
It is meaningful that a language is provided with several semantic descriptions: e.g. one which serves the needs of the implementor, another one that is suitable for specification and yet another one that will be used to explain the language to the user. In this case one has to guarantee that the various semantics are 'consistent' . The attempt of this paper is to clarify the notion 'consistency' and to present a general framework and theorems for consistency results.
منابع مشابه
On Proving the Equivalence of Concurrency Primitives
Various concurrency primitives have been added to sequential programming languages, in order to turn them concurrent. Prominent examples are concurrent buffers for Haskell, channels in Concurrent ML, joins in JoCaml, and handled futures in Alice ML. Even though one might conjecture that all these primitives provide the same expressiveness, proving this equivalence is an open challenge in the ar...
متن کاملA Semantics for Concurrent Logic Programming Languages Based on Multiple- Valued Logic
In order to obtain an understanding of parallel logic thought it is necessary to establish a fully abstract model of the denotational semantics of logic programming languages. In this paper, a fixed point semantics for the committed choice, nondeterministic family of parallel programming languages, i.e. the concurrent logic programming languages is developed. The approach is from an order theor...
متن کاملPhase Semantics and Veri cation of Concurrent Constraint
The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic linear logic for a variety of observables. In this paper we settle basic completeness results and we show how the phase semantics of linear logic can be used to provide simple and very concise \semantical" ...
متن کاملExecutable denotations for concurrent languages using Concurrent Transaction Logic
This paper presents an approach based on a Horn fragment of Concurrent Transaction Logic ( CT R) for semantic description and execution of programming languages. The Horn notation is used in much the same way that plain Horn logic is used to specify semantics of programming languages. However, CT R extends that framework a deductive database language which provides a declarative, logic programm...
متن کاملBisimulation and Fault-tolerance
Fault-tolerance is the crucial property for a safety-critical system: to perform as speciied in spite of failures in the operating environment. The purpose of this paper is to show how to establish such a property between a pair of concurrent systems: a high-level speciication and its fault-aaected implementation. We model a fault by a set of transitions and deene various extensions of the well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 29 شماره
صفحات -
تاریخ انتشار 1997